On Drawing Anti-Aliased Straight Lines
نویسندگان
چکیده
In this paper, an efficient algorithm is presented for drawing anti-aliased straight lines for two grey-level case; experimental results show that it is faster than Liu’s algorithm [6]. Specifically, Liu’s algorithm determines the grey-level of one pixel at a time while our algorithm determines the grey-levels of many pixels at the same time. In addition, our results for the two grey-level case can be extended to the multiple grey-level case.
منابع مشابه
Anti-Aliased Lines Using Run-Masks
In recent work, a set of line digitization algorithms based on the hierarchy of runs in the digital line has unified and generalized the iterative line-drawing algorithms used in computer graphics. In this paper, the additional structural information generated by these algorithms is leveraged to describe a run-based approach to draw anti-aliased line segments in which anti-aliased run-masks are...
متن کاملTexture Mapping as a Fundamental Drawing Primitive
Texture mapping has traditionally been used to add realism to computer graphics images. In recent years, this technique has moved from the domain of software rendering systems to that of high performance graphics hardware. But texture mapping hardware can be used for many more applications than simply applying diffuse patterns to polygons. Wesurvey applications of texturemapping including simpl...
متن کاملThe perceived orientation of aliased lines
The use of raster display devices for the display of graphics causes problems of aliasing when edges or lines are produced. This can be significant in those psychophysical experiments where the orientational properties of the stimulus are important. We have assessed the perceived orientation of a selection of aliased lines by comparing them with the orientation of pairs of dots. It is found tha...
متن کاملCombining Edges and Points for Interactive Anti-Aliased Rendering
This paper presents a new rendering and display paradigm that uses both discontinuities (edges) and sparsely sampled shading (points) to interactively generate anti-aliased images of complex scenes. Geometric and shadow discontinuities in the image are found at interactive rates using a novel data structure, the Normal–Position Interval tree, and algorithms based on interval arithmetic. After p...
متن کاملAliased Register Allocation for Straight-Line Programs Is NP-Complete
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of registers is homogeneous. In this paper we study registers which may alias: an aliased register can be used both independently or in combination with an adjacent register. Such registers are found in commonly-used architect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 15 شماره
صفحات -
تاریخ انتشار 1999